Searching for Effective Teachers with Imperfect Information

Using Imperfect Information to Identify Effective Teachers

Graph Searching, Parity Games and Imperfect Information

We investigate the interrelation between graph searching games and games with imperfect information. As key consequence we obtain that parity games with bounded imperfect information can be solved in Ptime on graphs of bounded DAG-width which generalizes several results for parity games on graphs of bounded complexity. We use a new concept of graph searching where several cops try to catch mult...

Imperfect quantum searching algorithm

We point out that the criterion, derived by Long et al.[Phys. Rev A 61, 042305 (2000)], to judging the degree of inaccuracy under systematic errors in phase inversions in Grover’s quantum search algorithm is overestimated. Although this criterion is properly deduced, it lacks a more accurate characterization to the relation between systematic errors and the size of a quantum database. The crite...

Navigability with Imperfect Information

The article studies navigability of an autonomous agent in a maze where some rooms may be indistinguishable. In a previous work the authors have shown that the properties of navigability in such a setting depend on whether an agent has perfect recall. Navigability by an agent with perfect recall is a transitive relation and without is not transitive. This article introduces a notion of restrict...

Games with Imperfect Information

An information set in a game tree is a set of nodes from which the rules of the game require that the same alternative (i.e., move) be selected. Thus the nodes an information set are indistinguishable to the player moving from that set, thereby reflecting imperfect information, that is, information hidden from that player. Information sets arise naturally in (for example) card gaines like poker...